An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints
نویسندگان
چکیده
Flexible manufacturing systems (FMSs) are nowadays installed in the mechanical industry. In such systems. many different part types are produced simultaneously and it is necessary to take tooling constraints into account for finding an optimal schedule. A heuristic method is presented for solving the m-machine, n-job shop scheduling problem with tooling constraints. This method. named TOMATO, is based on an adaptation of tabu search techniques and is an improvement on the JEST algorithm proposed by Widmcr in 1991. Keq’Mords: Flexible manufacturing system; Job shop scheduling: Tooling constraints: Tabu search
منابع مشابه
An Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملSolving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملMulti-Agent Approach Based on Tabu Search for the Flexible Job Shop Scheduling Problem
This paper proposes a Multi-agent approach based on a tabu search method for solving the flexible Job Shop scheduling problem. The characteristic of the latter problem is that one or several machines can process one operation so that its processing time depends on the machine used. Such a generalization of the classical problem makes it more and more difficult to solve. The objective is to mini...
متن کاملFlow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کاملA Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE)
This paper proposes a novel, bi-objective mixed-integer mathematical programming for an open shop scheduling problem (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a fuzzy multi-objective decision making (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 65 شماره
صفحات -
تاریخ انتشار 1996